Disjunctive Programming for Multiobjective Discrete Optimisation
نویسندگان
چکیده
منابع مشابه
Disjunctive Programming for Multiobjective Discrete Optimisation
In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsup...
متن کاملOn the relationship between probabilistic constrained, disjunctive and multiobjective programming
A probabilistic constrained stochastic programming model is formulated, where one term in the objective function, to be minimized, is the maximum of a finite or infinite number of linear functions. The model is reformulated as a finite or semiinfinite disjunctive programming problem. Duality relationships are established for both the original and the convexified problems. Numerical solution tec...
متن کاملHyperheuristic Approaches for Multiobjective Optimisation
In multiobjective optimisation the aim is to find solutions that represent a compromise between the various (sometimes conflicting) criteria used to evaluate the quality of solutions. A solution x is said to be non-dominated with respect to a set of solutions S if there is no other solution in S that is, as good as x in all the criteria and better than x in at least one of the criteria. In Pare...
متن کاملOptimization of Discrete-Continuous Dynamic Systems Based on Disjunctive Programming
In this contribution, a novel approach for the modeling and optimization of discrete-continuous dynamic systems based on a disjunctive problem formulation is proposed. It will be shown that a disjunctive model representation, which constitutes an alternative to mixed-integer model formulations, provides a very flexible and intuitive way to formulate discrete-continuous dynamic optimization prob...
متن کاملDisjunctive Programming
In April 1967 I and my family arrived into the US as fresh immigrants from behind the Iron Curtain. After a fruitful semester spent with George Dantzig’s group in Stanford, I started working at CMU. My debut in integer programming and entry ticket into Academia was the additive algorithm for 0-1 programming [B65], an implicit enumeration procedure based on logical tests akin to what today goes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2018
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2017.0804